Finite automata - PDFSEARCH.IO - Document Search Engine

Finite automata
Results: 673

#	Item
351	Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-03-08 11:06:55 Computability theory Automata theory Theory of computation Models of computation Church–Turing thesis Finite-state machine Algorithm Decidability Krohn–Rhodes theory Theoretical computer science Computer science Mathematics
352	On Determinisation of History-Deterministic Automata. Denis Kuperberg Michal Skrzypczak Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-07-07 08:10:22 Computer science Finite-state machine Büchi automaton Deterministic pushdown automaton Automata theory Models of computation Theoretical computer science
353	Automata theory Hard decision problems Regular Cost Functions Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-10-15 08:27:58 Mathematics Semigroup theory Algebra Category theory Models of computation Regular language Monoid Finite-state machine Free monoid Formal languages Abstract algebra Automata theory
354	Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-12-02 12:39:02 Mathematics Automata theory Models of computation Theory of computation Church–Turing thesis Finite-state machine Algorithm Decidability Krohn–Rhodes theory Theoretical computer science Computer science Computability theory
355	Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , Orna Kupferman1 1 Hebrew University of Jerusalem Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2014-09-05 08:28:57 Deterministic automaton Finite-state machine Ω-automaton Automata theory Theoretical computer science Computer science
356	AUTOMATA Thus far we have been concerned with two major topics: the discovery of an appropriate model for computation and an examination of the intrinsic properties of computation in general. We found that since Turing m Add to Reading List Source URL: www.cs.uky.edu Language: English - Date: 2001-02-14 12:47:25 Automata theory Computer science Computability theory Turing machine Finite-state machine Linear bounded automaton Decision problem Theory of computation Theoretical computer science Models of computation
357	Hyper-Minimization 2 in O(n ) Andrew Badr [removed] CIAA 2008 Add to Reading List Source URL: www.andrewbadr.com Language: English - Date: 2008-07-21 15:34:44 Equivalence class Presentation of a group Computer science Applied mathematics Deterministic finite automaton DFA minimization Automata theory Mathematics Regular language
358	Overview Lecture T2: Turing Machines Attempt to understand essential nature of computation by studying properties of simple machine models. Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-02-02 11:59:52 Automata theory Turing machine Computer science Deterministic pushdown automaton Finite-state machine Linear bounded automaton National Parliamentary Debate Association NP Pushdown automaton Theory of computation Models of computation Theoretical computer science
359	JFP 19 (2): 173–190, [removed]c 2009 Cambridge University Press 173 Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2009-03-09 07:00:56 Combinatorics Software engineering Symbol String Regular language Regular expression Nondeterministic finite automaton Automata theory Formal languages Theoretical computer science
360	Hyper-Minimization in O(n2 ) Andrew Badr [removed] Flowgram Research Division 650 Townsend #315 San Francisco, CA 94103 Add to Reading List Source URL: www.andrewbadr.com Language: English - Date: 2008-07-27 22:06:23 DFA minimization Regular language Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Automata theory Theoretical computer science Computer science

UPDATE